Easy instances for model checking
نویسنده
چکیده
Lösung des jeweiligen Model-Checking Problems " nur " noch die Teilergeb-nisse zusammengesetzt werden. Auf diese Weise lösen wir die vier angespro-chenen Model-Checking Probleme für die Logik der ersten Stufe auf lokal baumartigen Strukturen (nicely locally tree-decomposable classes). Diese Algorithmen arbeiten alle in Zeit linear in der Größe der Eingabestruktur (plus der Größe der Ausgabe beim Aufzählungsproblem). Damit ist auch dieser Problembereich vollständig gelöst.
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملLurch: a Lightweight Alternative to Model Checking
Formal methods, including model checking, is powerful but can be costly, in terms of memory, time, and modeling effort. Difficult problems, similar to the verification problem addressed by model checking, have been shown to exhibit a phase transition, suggesting that an easy range of problem instances might be solved much faster and with much less memory using a new type of model checker based ...
متن کاملTarmo: A Framework for Parallelized Bounded Model Checking
This paper investigates approaches to parallelizing Bounded Model Checking (BMC) for shared memory environments as well as for clusters of workstations. We present a generic framework for parallelized BMC named Tarmo. Our framework can be used with any incremental SAT encoding for BMC but for the results in this paper we use only the current state-of-the-art encoding for full PLTL [4]. Using th...
متن کاملPruning Techniques for the SAT-based Bounded Model Checking Problem
Bounded Model Checking (BMC) is the problem of checking if a model satisses a temporal property in paths with bounded length k. Propositional SAT-based BMC is conducted in a gradual manner, by solving a series of SAT instances corresponding to formulations of the problem with increasing k. We show how the gradual nature can be exploited for shortening the overall veriication time. The concept i...
متن کاملInterpolation and SAT-Based Model Checking
We consider a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circuit verification instances, this method is greatly more efficient than BDD-based symbolic model checking, and compares favorably to some recent SAT-based model checking methods on positive instances.
متن کامل